RECM: Relational evidential c-means algorithm
نویسندگان
چکیده
منابع مشابه
RECM: Relational evidential c-means algorithm
A new clustering algorithm for proximity data, called RECM (Relational evidential c-means) is presented. This algorithm generates a credal partition, a new clustering structure based on the theory of belief functions, which extends the existing concepts of hard, fuzzy and possibilistic partitions. Two algorithms, EVCLUS (Evidential Clustering) and ECM (Evidential c-Means) were previously availa...
متن کاملECM: An evidential version of the fuzzy c-means algorithm
A new clustering method for object data, called ECM (Evidential c-means) is introduced, in the theoretical framework of belief functions. It is based on the concept of credal partition, extending those of hard, fuzzy and possibilistic ones. To derive such a structure, a suitable objective function is minimized using a FCM-like algorithm. A validity index allowing the determination of the proper...
متن کاملImprovements to the relational fuzzy c-means clustering algorithm
Relational fuzzy c-means (RFCM) is an algorithm for clustering objects represented in a pairwise dissimilarity values in a dissimilarity data matrix D. RFCM is dual to the fuzzy c-means (FCM) object data algorithm when D is a Euclidean matrix. When D is not Euclidean, RFCM can fail to execute if it encounters negative relational distances. To overcome this problem we can Euclideanize the relati...
متن کاملMedian evidential c-means algorithm and its application to community detection
Median clustering is of great value for partitioning relational data. In this paper, a new prototype-based clustering method, called Median Evidential C-Means (MECM), which is an extension of median c-means and median fuzzy c-means on the theoretical framework of belief functions is proposed. The median variant relaxes the restriction of a metric space embedding for the objects but constrains t...
متن کاملKernelized Non-Euclidean Relational c-Means Algorithms
Successes with kernel-based classification methods have spawned many recent efforts to kernelize clustering algorithms for object data. We extend this idea to the relational data case by proposing kernelized forms of the non-Euclidean relational fuzzy (NERF) and hard (NERH) c-means algorithms. We show that these relational forms are dual to kernelized forms of fuzzy and hard c-means (FCM, HCM) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2009
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2009.04.008